On self-dual MRD codes

نویسندگان

  • Gabriele Nebe
  • Wolfgang Willems
چکیده

We determine the automorphism group of Gabidulin codes of full length and characterise when these codes are equivalent to self-dual codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rank-metric LCD codes

In this paper, we investigate the rank-metric codes which are proposed by Delsarte and Gabidulin to be complementary dual codes. We point out the relationship between Delsarte complementary dual codes and Gabidulin complementary dual codes. In finite field Fmq , we construct two classes of Gabidulin LCD MRD codes by self-dual basis (or almost self-dual basis) of Fmq over Fq. Under a suitable co...

متن کامل

On dually almost MRD codes

In this paper we define and study a family of codes which come close to be MRD codes, so we call them AMRD codes (almost MRD). An AMRD code is a code with rank defect equal to 1. AMRD codes whose duals are AMRD are called dually AMRD. Dually AMRD codes are the closest to the MRD codes given that both they and their dual codes are almost optimal. Necessary and sufficient conditions for the codes...

متن کامل

New criteria for MRD and Gabidulin codes and some Rank-Metric code constructions

Codes in the rank metric have been studied for the last four decades. For linear codes a Singleton-type bound can be derived for these codes. In analogy to MDS codes in the Hamming metric, we call rank-metric codes that achieve the Singleton-type bound MRD (maximum rank distance) codes. Since the works of Delsarte [3] and Gabidulin [4] we know that linear MRD codes exist for any set of paramete...

متن کامل

Properties of Codes with the Rank Metric

In this paper, we study properties of rank metric codes in general and maximum rank distance (MRD) codes in particular. For codes with the rank metric, we first establish Gilbert and sphere-packing bounds, and then obtain the asymptotic forms of these two bounds and the Singleton bound. Based on the asymptotic bounds, we observe that asymptotically Gilbert-Varsharmov bound is exceeded by MRD co...

متن کامل

Rank distribution of Delsarte codes

In analogy with the Singleton defect for classical codes, we propose a definition of rank defect for Delsarte rank-metric codes. We characterize codes whose rank defect and dual rank defect are both zero, and prove that the rank distribution of such codes is determined by their parameters. This extends a result by Delsarte on the rank distribution of MRD codes. In the general case of codes of p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Adv. in Math. of Comm.

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2016